Computer Finding of Four-element Multiplicatively Idempotent Semirings
نویسندگان
چکیده
In this paper we describe a computer program for searching all four-element multiplicatively idempotent semirings. We have established that up to the isomorphism of such semirings exactly 381, they are represented by Cayley tables additive and multiplicative reducts. give necessary definitions, properties illustrations.
منابع مشابه
Non-termination in Idempotent Semirings
We study and compare two notions of non-termination on idempotent semirings: infinite iteration and divergence. We determine them in various models and develop conditions for their coincidence. It turns out that divergence yields a simple and natural way of modelling infinite behaviour, whereas infinite iteration shows some anomalies.
متن کاملOn idempotent matrices over semirings
Idempotent matrices play a significant role while dealing with different questions in matrix theory and its applications. It is easy to see that over a field any idempotent matrix is similar to a diagonal matrix with 0 and 1 on the main diagonal. Over a semiring the situation is quite different. For example, the matrix J of all ones is idempotent over Boolean semiring. The first characterizatio...
متن کاملIdempotent Subreducts of Semimodules over Commutative Semirings
A short proof of the characterization of idempotent subreducts of semimodules over commutative semirings is presented. It says that an idempotent algebra embeds into a semimodule over a commutative semiring, if and only if it belongs to the variety of Szendrei modes.
متن کاملCategories of Algebraic Contexts Equivalent to Idempotent Semirings and Domain Semirings
A categorical equivalence between algebraic contexts with relational morphisms and join-semilattices with homomorphisms is presented and extended to idempotent semirings and domain semirings. These contexts are the Kripke structures for idempotent semirings and allow more efficient computations on finite models because they can be logarithmically smaller than the original semiring. Some example...
متن کاملAlgebraic notions of nontermination: Omega and divergence in idempotent semirings
Two notions of nontermination are studied and compared in the setting of idempotent semirings: Cohen’s omega operator and a divergence operator. They are determined for various computational models, and conditions for their existence and their coincidence are given. It turns out that divergence yields a simple and natural way of modelling infinite behaviours of programs and discrete systems, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vestnik Permskogo universiteta
سال: 2022
ISSN: ['1993-0550']
DOI: https://doi.org/10.17072/1993-0550-2022-2-46-52